package org.rescue.analysis.summarize;

/* A candidate tree is a set of nodes where a node will retain its taxonomy parent
 * (if it is in the candidate list) or has its closest ancestor in the cadidate 
 * list as its parent. */

public class SCandidateData {
	String label;
	int id;
	int dCard; // number of docs not covered by any descendent of this node 
	int card;
	int subCandsCount;
	double infoLoss; // amount of info lost so far by merging into this concept	
//	boolean isLeaf;
//	int height;		
 //	int distToRoot; // distance of corresponding concept to the root	
//	int distToCandParent; /* taxonomy distance of this node with its candidate parent.
//    since merging may remove nodes between two candidate nodes */	

	public SCandidateData() {
		subCandsCount = 0;
		dCard = 0;
		card = 0;
	}

	public int getCard() {
		return card;
	}

	public void setCard(int card) {
		this.card = card;
	}

	public int getDCard() {
		return dCard;
	}

	public void setDCard(int card) {
		dCard = card;
	}

	public double getInfoLoss() {
		return infoLoss;
	}

	public void setInfoLoss(double infoLoss) {
		this.infoLoss = infoLoss;
	}

	public String getLabel() {
		return label;
	}

	public void setLabel(String label) {
		this.label = label;
	}

	public int getSubCandsCount() {
		return subCandsCount;
	}

	public void setSubCandsCount(int subCandsCount) {
		this.subCandsCount = subCandsCount;
	}

	public int getId() {
		return id;
	}

	public void setId(int id) {
		this.id = id;
	}	
	
	
}
